On the optimal placement of wavelength converters in WDM networks

نویسندگان

  • Xiaohua Jia
  • Ding-Zhu Du
  • Xiao-Dong Hu
  • Hejiao Huang
  • Deying Li
چکیده

An important goal of the design of wavelength division multiplexing (WDM) networks is to use less wavelengths to serve more communication needs. According to the wavelength conflict rule, we know that the number of wavelengths required in a WDM network is at least equal to the maximal number of channels over a fiber (called maximal link load) in the network. By placing wavelength converters at some nodes in the network, the number of wavelengths needed can be made equal to the maximal link load. In this paper, we study the problem of placing the minimal number of converters in a network to achieve that the number of wavelengths in use is equal to the maximal link load. For duplex communication channels, we prove that the optimal solution can be obtained in polynomial-time. For unidirectional communication channels, which was proved to be NP-complete, we develop a set of lemmas which lead to a simple approximation algorithm whose theoretically guaranteed performance ratio is at most two. q 2002 Published by Elsevier Science B.V.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal placement of wavelength converters in trees, tree-connected rings, and tree of rings

In wavelength routed optical networks, wavelength converters can potentially reduce the requirement on the number of wavelengths. A recent study [Proceedings of 9th ACM-SIAM Symposium on Discrete Algorithms (1998)] raised the following problem: choose a minimum number of nodes in a WDM network to place wavelength converters so that any set of paths requires the same number of wavelengths as if ...

متن کامل

An Optimization Model for Placement of Wavelength Converters to Minimize Blocking Probability in WDM Networks

The introduction of wavelength converters in wavelength division multiplexing (WDM) networks can reduce the blocking probabilities of calls. In this paper, we study the problem of placing a given number of converters in a general topology WDM network such that the overall system blocking probability is minimized. The original contributions of this work are the following: 1) formulation of succe...

متن کامل

Optimal placement of wavelength converters in trees and trees of rings

In wavelength routed optical networks, wavelength converters can potentially reduce the requirement on the number of wavelengths. The problem of placing a minimum number of wavelength converters in a WDM network so that any routing can be satisfied using no more wavelengths than if there were wavelength converters at every node was raised in [16] and shown to be NP-complete in general WDM netwo...

متن کامل

Placement of Light Splitters and Wavelength Converters for Efficient Multicast in All-Optical WDM Networks

This paper studies the problem of light splitter placement (LSP) and wavelength converter placement (WCP) in all-optical WDM networks to enable optimal provisioning of static and dynamic traffic through efficient photonic multicast connections. To solve the LSP-WCP problem under static traffic provisioning, an Integer Linear Programming model is formulated to achieve the optimal solution in the...

متن کامل

Efficient Algorithms for Wavelength Converter Placement in All-optical Networks

In this paper, we consider the optimal converter placement problem for a given number of converters on a path topology in all-optical WDM networks. The placement of converters on a path divides the path into segments. A segment is deened as a set of links between two consecutive converters on a path. We rst introduce and prove that optimal placement considering end-to-end performance is obtaine...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Communications

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2003